Decomposing Complete 3-Uniform Hypergraph (3) 45 K into 7−Cycles
نویسندگان
چکیده
منابع مشابه
Decomposing complete 3-uniform hypergraphs into Hamiltonian cycles
Using the Katona-Kierstead definition of a Hamiltonian cycle in a uniform hypergraph, we continue the investigation of the existence of a decomposition of the complete 3-uniform hypergraph into Hamiltonian cycles began by Bailey and Stevens. We also discuss two extensions of the problem: to the complete 3-uniform hypergraph from which a parallel class of triples has been removed, and to the com...
متن کاملOn decomposing a hypergraph into k connected sub-hypergraphs
By applying the matroid partition theorem of J. Edmonds [1] to a hypergraphic generalization of graphic matroids, due to M. Lorea [3], we obtain a generalization of Tutte’s disjoint trees theorem for hypergraphs. As a corollary, we prove for positive integers k and q that every (kq)-edge-connected hypergraph of rank q can be decomposed into k connected sub-hypergraphs, a well-known result for q...
متن کاملThe Hardness of 3 - Uniform Hypergraph Coloring
We prove that coloring a 3-uniform 2-colorable hypergraph with c colors is NP-hard for any constant c. The best known algorithm [20] colors such a graph using O(n1/5) colors. Our result immediately implies that for any constants k ≥ 3 and c2 > c1 > 1, coloring a k-uniform c1-colorable hypergraph with c2 colors is NP-hard; the case k = 2, however, remains wide open. This is the first hardness re...
متن کاملDecompositions of complete 3-uniform hypergraphs into small 3-uniform hypergraphs
In this paper we consider the problem of determining all values of v for which there exists a decomposition of the complete 3-uniform hypergraph on v vertices into edge-disjoint copies of a given 3-uniform hypergraph. We solve the problem for each 3-uniform hypergraph having at most three edges and at most six vertices, and for the 3-uniform hypergraph of order 6 whose edges form the lines of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DEStech Transactions on Environment, Energy and Earth Sciences
سال: 2017
ISSN: 2475-8833
DOI: 10.12783/dteees/eesd2017/11995